Non-branchng Tree-decompositions
نویسنده
چکیده
We prove that if a graph has a tree-decomposition of width at most w, then it has a tree-decomposition of width at most w with certain desirable properties. We will use this result in a subsequent paper to show that every 2-connected graph of large path-width has a minor isomorphic to either a large tree with a vertex attached to every vertex of the tree or a large outerplanar graph.
منابع مشابه
Simplicial Decompositions, Tree-decompositions and Graph Minors
The concepts of simplicial decompositions, tree-decompositions and simplicial tree-decompositions were all inspired by a common forerunner: the decompositions of finite graphs used by K. Wagner in his classic paper [ 13 ], in which he proved the equivalence of the 4-Colour-Conjecture to Hadwiger’s Conjecture for n = 5. To show that the 4CC implies Hadwiger’s Conjecture (for n = 5), Wagner used ...
متن کاملSimplicial tree-decompositions of infinite graphs, I
This paper is intended as an introduction to the theory of simplicial decompositions of graphs. It presents, in a unified way, new results as well as some basic old ones (with new proofs). Its main result is a structure theorem for infinite graphs with a simplicial tree-decomposition into primes. The existence and uniqueness of such prime decompositions will be investigated in two subsequent pa...
متن کاملBag-Connected Tree-Width: A New Parameter for Graph Decomposition
For solving constraints networks (CSPs), (tree-)decomposition methods have shown their practical interest. But for the problem of computing tree-decompositions, the literature (coming from AI or from Mathematics) has concentrated the work on a single parameter, the tree-width. Nevertheless, experimental studies have shown that when a decomposition is used to solve a CSP, other parameters must a...
متن کاملSize-Constrained Tree Decompositions
Tree-Decompositions are the corner-stone of many dynamic programming algorithms for solving graph problems. Since the complexity of such algorithms generally depends exponentially on the width (size of the bags) of the decomposition, much work has been devoted to compute tree-decompositions with small width. However, practical algorithms computing tree-decompositions only exist for graphs with ...
متن کاملNew Heuristic Methods for Tree Decompositions and Generalized Hypertree Decompositions
Many practical hard problems in mathematics and computer science may be formulated as constraint satisfaction problems (CSPs). Tree and generalized hypertree decompositions are two important concepts which can be used for identifying and solving tractable classes of CSPs. Unfortunately the task of finding an optimal tree or generalized hypertree decomposition is an NP-complete problem. Thus man...
متن کامل